Combinators for impure yet hygienic code generation
نویسندگان
چکیده
منابع مشابه
Hygienic Source-Code Generation Using Functors
Existing source-code-generating tools such as Lex and Yacc suffer from practical inconveniences because they use disembodied code to implement actions. To prevent this problem, such tools could generate closed functors that are then instantiated by the programmer with appropriate action code. This results in all code being type checked in its appropriate context, and it assists the type checker...
متن کاملTag-Free Combinators for Binding-Time Polymorphic Program Generation
Binding-time polymorphism enables a highly flexible bindingtime analysis for offline partial evaluation. This work provides the tools to translate this flexibility into efficient program specialization in the context of a polymorphic language. Following the cogen-combinator approach, a set of combinators is defined in Haskell that enables the straightforward transcription of a bindingtime polym...
متن کاملImpure altruism and impure selfishness
Altruism refers to a willingness to benefit others, even at one’s own expense. In contrast, selfishness refers to prioritizing one’s own interests with no consideration for others. However, even if an agent is selfish, he might nevertheless act as if he were altruistic out of selfish concerns triggered when his action is observed; that is, he might seek to feel pride in acting altruistically an...
متن کاملCode Generation for Mercury
Mercury is a new purely declarative logic programming language that requires programmers to write declarations for every predicate in the program. Although the main motivation for this requirement is that it allows the compiler to catch most programmer errors, it also allows the Mercury code generator to rely on the presence of type, mode and determinism information about every predicate in the...
متن کاملCode Generation for Multiple
There has been a great amount of recent work toward unifying iteration reordering transformations. Many of these approaches represent transformations as aane mappings from the original iteration space to a new iteration space. These approaches show a great deal of promise, but they all rely on the ability to generate code that iterates over the points in these new iteration spaces in the approp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 2015
ISSN: 0167-6423
DOI: 10.1016/j.scico.2015.08.007